A Set of Examples of Global and Discrete Optimization: Application of Bayesian

ثبت نشده
چکیده

The following topics are important teaching operation research: games theory, decision theory, utility theory, queuing theory, scheduling theory, discrete optimization. These topics are illustrated and the connection with global optimization is shown considering the following mathematical models: competition model with fixed resource prices, Nash equilibrium, competition model with free resource prices, Walras equilibrium, inspector's problem, multi-stage game model, "Star War" problem, differential game model, "Portfolio" problem, resource investment model, exchange rate prediction, Auto-Regression-Moving-Average (ARMA) model, optimal scheduling, Bayesian heuristic model, "Bride's" problem, sequential statistical decisions model. The first seven models are solved using a set of algorithms of continuous global and stochastic optimization. The global optimization software GM (see [19]) is used. The underlying theory of this software and algorithms of solution are described in [19, 17]. The last model is an example of stochastic dynamic programming. For better understanding, all the models are formulated in simplest terms as "classroom" examples. However, each of these models can be regarded as simple representations of important families of real-life problems. Therefore the models and solution algorithms may be of interest for application experts, too. The paper is split into two parts. In the part one [18] the first five models are described. In this part the rest three models and accompanyiing software are considered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Testing Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures

Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...

متن کامل

COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION

In the present paper, an approach is proposed for structural topology optimization based on combination of Radial Basis Function (RBF) Level Set Method (LSM) with Isogeometric Analysis (IGA). The corresponding combined algorithm is detailed. First, in this approach, the discrete problem is formulated in Isogeometric Analysis framework. The objective function based on compliance of particular lo...

متن کامل

Bayesian heuristic approach to global optimization and examples

The traditional numerical analysis considers optimization algorithms which guarantee some accuracy for all functions to be optimized. This includes the exact algorithms. Limiting the maximal error requires a computational effort that in many cases increases exponentially with the size of the problem (Horst and Pardalos, 1995, Handbook of Global Optimization, Kluwer). That limits practical appli...

متن کامل

A Set of Examples of Global and Discrete Optimization: Application of Bayesian

The following topics are important teaching operation research: games theory; decision theory; utility theory; queuing theory; scheduling theory; discrete optimization. These topics are illustrated and the connection with global optimization is shown considering the following mathematical models: competition model with fixed resource prices, Nash equilibrium; competition model with free resourc...

متن کامل

Continuous Discrete Variable Optimization of Structures Using Approximation Methods

Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014